package main

import (
	"golang-study/algorithm/treeNode"
)
/*
			0
	1				2
3		4		5		6
*/
func initTreeNode() *treeNode.TreeNode {
	node6 := treeNode.TreeNode{Value: 6, LeftNode: nil, RightNode: nil}
	node5 := treeNode.TreeNode{Value: 5, LeftNode: nil, RightNode: nil}
	node4 := treeNode.TreeNode{Value: 4, LeftNode: nil, RightNode: nil}
	node3 := treeNode.TreeNode{Value: 3, LeftNode: nil, RightNode: nil}
	node2 := treeNode.TreeNode{Value: 2, LeftNode: &node5, RightNode: &node6}
	node1 := treeNode.TreeNode{Value: 1, LeftNode: &node3, RightNode: &node4}
	root := treeNode.TreeNode{Value: 0, LeftNode: &node1, RightNode: &node2}
	return &root
}


